Finite pseudocomplemented lattices and 'permutoedre'

نویسندگان

  • C. Chameni Nembua
  • Bernard Monjardet
چکیده

We study finite pseudocomplemented lattices and especially those that are also complemented. With regard to the classical results on arbitrary or distributive pseudocomplemented lattices the finiteness property allows to bring significant more precise details on the structural properties of such lattices. These results can especially be applied to the lattices defined by the "weak Bruhat order" on a Coxeter group (and for instance to the lattice of permutations, called in French "le treillis permutoèdre") and to the lattice of binary bracketings. Résumé Soit T un treillis avec plus petit élément noté 0 ; l'élément t de T a un inf-pseudocomplément, noté g(t), si g(t) est le plus grand élément de l'ensemble des x de T tels que x∧t = 0 ; T est inf-pseudocomplémenté (IPC.) si tout élément de T a un inf-pseudocomplément. On définit dualement la notion de sup-pseudocomplément f(t) de l'élément t et de treillis sup-pseudocomplémenté (SPC) et par conjonction des deux propriétés IPC et SPC celle de treillis pseudocomplémenté. Ces treillis ont surtout été étudiés dans des cas où ils sont distributifs et infinis (treillis de Brouwer ou d' Heyting, treillis de Stone...). Notre intérêt pour le cas fini provient-entre autres-de ce que le "treillis permutoèdre"(Guilbaud et Rosenstiehl 1971), i.e. l'ensemble des permutations d'un ensemble fini muni de l'"ordre faible de Bruhat", est un treillis pseudo complémenté. Dans le cas d'un treillis IPC la classique correspondance de Galois associée à l'application g d' inf-pseudocomplémentation permet de montrer que l'ensemble des inf-pseudo compléments a une structure de treillis booléen (Frink 1962). Dans le cas fini, nous donnons d'abord une caractérisation constructive des inf-pseudocompléments permettant de retrouver ce résultat. Nous montrons ensuite que pour un treillis complémenté les propriétés d'être IPC ou SPC sont équivalentes. Nous décrivons ensuite de façon approfondie la structure des treillis complémentés pseudocomplémentés, ces derniers résultats s'appliquant au treillis permutoèdre et au treillis des parenthésages.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Note on Negation: A PCS-Completion of Semilattices

In the paper “Which concept lattices are pseudocomplemented?” ([GK05]) we gave a contextual characterization of pseudocomplemented concept lattices by means of the arrow relations. In this contribution we use this description to embed finite semilattices into pseudocomplemented semilattices. This process can be used to define a negation on concepts.

متن کامل

Reducibility in Finite Posets

All the posets/lattices considered here are finite with element 0. An element x of a poset satisfying certain properties is deletable if P − x is a poset satisfying the same properties. A class of posets is reducible if each poset of this class admits at least one deletable element. When restricted to lattices, a class of lattices is reducible if and only if one can go from any lattice in this ...

متن کامل

Principal Congruences of /7-algebras and Double /»-algebras

Principal congruence of pseudocomplemented lattices (= palgebras) and of double pseudocomplemented lattices (= double p-algebras), i.e. pseudocomplemented and dual pseudocomplemented ones, are characterized.

متن کامل

The Structure of Pseudocomplemented Distributive Lattices. I: Subdirect Decomposition

In this paper all subdirectly irreducible pseudocomplemented distributive lattices are found. This result is used to establish a Stone-like representation theorem conjectured by G. Grätzer and to find all equational subclasses of the class of pseudocomplemented distributive lattices.

متن کامل

Pseudocomplementation in (normal) subgroup lattices

The goal of this paper is to study finite groups admitting a pseudocomplemented subgroup lattice (PK-groups) or a pseudocomplemented normal subgroup lattice (PKN-groups). In particular, we obtain a complete classification of finite PK-groups and of finite nilpotent PKN-groups. We also study groups with a Stone normal subgroup lattice, and we classify finite groups for which every subgroup has a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 111  شماره 

صفحات  -

تاریخ انتشار 1993